On-line scheduling with delivery time on a single batch machine
نویسندگان
چکیده
منابع مشابه
On-line scheduling with delivery time on a single batch machine
We consider a single batch machine on-line scheduling problem with jobs arriving over time. A batch processing machine can handle up to B jobs simultaneously as a batch, and the processing time for a batch is equal to the longest processing time among the jobs in it. Each job becomes available at its arrival time, which is not known in advance, and its characteristics, such as processing time a...
متن کاملBatch delivery scheduling with batch delivery cost on a single machine
We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on a single machine. The jobs are delivered in batches and the delivery date of a batch equals the completion time of the last job in the batch. The delivery cost depends on the number of deliveries. The objective is to minimize the sum of the total weighted flow time and delivery cost....
متن کاملOn-line machine scheduling with batch setups
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch start and complete together, and a constant setup is prior to each batch. The objective is to minimize the total completion time of all jobs. We primarily consider the special cases of these problems with identical proce...
متن کاملSingle Machine Scheduling with Deterioration Effect on Delivery Time ∗
A single machine scheduling problem with delivery time is considered. Job’s delivery time has deterioration effect. For the same processing time model of minimizing different objectives, it is given optimal sequences, respectively. For the same deterioration ratio model, we also give optimal sequences for different objectives. Mathematics Subject Classification: 91A35
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.12.001